Elements of Convex Optimization Theory
نویسنده
چکیده
This is a revised and extended version of Appendix A of Skiadas (2009), providing a self-contained overview of elements of convex optimization theory. The presentation is limited to the finite-dimensional case, but from an advanced perspective that is amenable to generalization. Some results, like the projection theorem and the Riesz representation theorem for Hilbert spaces, are stated and proved in a way that also applies to infinitedimensional spaces, since doing so comes at negligible additional cost. On the other hand, instances where the finite dimensionality assumption is essential are noted.
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملGreedy approximation in convex optimization
We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using different greedy-type algorithms. The prob...
متن کاملGreedy expansions in convex optimization
This paper is a follow up to the previous author’s paper on convex optimization. In that paper we began the process of adjusting greedytype algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there three the most popular in nonlinear approximation in Banach spaces greedy algorithms – Weak Chebyshev Greedy Algorithm, Weak Greedy Algor...
متن کاملCharacterization of proper optimal elements with variable ordering structures
In vector optimization with a variable ordering structure the partial ordering defined by a convex cone is replaced by a whole family of convex cones, one associated with each element of the space. In recent publications it was started to develop a comprehensive theory for these vector optimization problems. Thereby also notions of proper efficiency were generalized to variable ordering structu...
متن کاملA Compositional Approach to Network Algorithms
We present elements of a typing theory for flow networks, where “types”, “typings”, and “type inference” are formulated in terms of familiar notions from polyhedral analysis and convex optimization. Based on this typing theory, we develop an alternative approach to the design and analysis of network algorithms, which we illustrate by applying it to the max-flow problem in multiple-source, multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015